On a correspondence between maximal cliques in Paley graphs of square order
نویسندگان
چکیده
Let q be an odd prime power. Denote by r(q) the value of modulo 4. In this paper, we establish a linear fractional correspondence between two types maximal cliques size q+r(q)2 in Paley graph order q2.
منابع مشابه
Finding All Maximal Cliques in Dynamic Graphs
Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like Gt = (V,Et), where Et−1 ⊂ Et, t = 1, . . . , T ;E0 = φ. In thi...
متن کاملOn Effectively Finding Maximal Quasi-cliques in Graphs
The problem of finding a maximum clique in a graph is prototypical for many clustering and similarity problems; however, in many real-world scenarios, the classical problem of finding a complete subgraph needs to be relaxed to finding an almost complete subgraph, a so-called quasi-clique. In this work, we demonstrate how two previously existing definitions of quasi-cliques can be unified and ho...
متن کاملOn graphs whose maximal cliques and stable sets intersect
We say that a graph G has the CIS-property and call it a CIS-graph if every maximal clique and every maximal stable set of G intersect. By definition, G is a CIS-graph if and only if the complementary graph G is a CISgraph. Let us substitute a vertex v of a graph G′ by a graph G′′ and denote the obtained graph by G. It is also easy to see that G is a CIS-graph if and only if both G′ and G′′ are...
متن کاملStereo Correspondence Through Feature Grouping and Maximal Cliques
In this paper we propose a method to solve the stereo correspondence problem. The method matches features and feature relationships and can be paraphrased as follows. Linear edge segments are extracted from both the left and right images. Each such segment is characterized by its position and orientation in the image as well as its relationships with the nearby segments. A relational graph is t...
متن کاملLarge Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be viewed as a clique in the graph representing the social network. In several real life situations, finding small cliques may not be interesting as they are large in number and low in information content. Hence, in this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.112853